LACK OF SPHERE PACKING OF GRAPHS VIA NONLINEAR POTENTIAL THEORY
نویسندگان
چکیده
منابع مشابه
On Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملThe Sphere Packing Bound via Augustin's Method
The channel coding problem is reviewed for an abstract framework. If the scaled Renyi capacities of a sequence of channels converge to a finite continuous function φ on an interval of the form (1− ε, 1] for an ε > 0, then the capacity of the sequence of channels is φ(1). If the convergence holds on an interval of the form (1 − ε, 1 + ε) then the strong converse holds. Both hypotheses hold for l...
متن کاملFrom Sphere Packing to the Theory of Optimal Lattice Sampling
In this paper we introduce reconstruction kernels for the 3D optimal sampling lattice and demonstrate a practical realisation of a few. First, we review fundamentals of multidimensional sampling theory. We derive the optimal regular sampling lattice in 3D, namely the Body Centered Cubic (BCC) lattice, based on a spectral sphere packing argument. With the introduction of this sampling lattice, w...
متن کاملon open packing number of graphs
in a graph g = (v,e), a subset s v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.
متن کاملNew horizons in sphere-packing theory, part II: lattice-based derivative-free optimization via global surrogates
Derivative-free algorithms are frequently required for the optimization of nonsmooth scalar functions in n dimensions resulting, for example, from physical experiments or from the statistical averaging of numerical simulations of chaotic systems such as turbulent flows. The core idea of all efficient algorithms for problems of this type is to keep function evaluations far apart until convergenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Topology and Analysis
سال: 2013
ISSN: 1793-5253,1793-7167
DOI: 10.1142/s1793525313500039